منابع مشابه
Parallel Game Tree Search on SIMD Machines
We describe an approach to the parallelization of game tree search on SIMD machines. It turns out that the single-instruction restriction of SIMD-machines is not a big obstacle for achieving eeciency. We achieve speedups up to 5850 on a 16K processor MasPar MP-1 if the search trees are suuciently large and if there are no strong move ordering heuristics. To our best knowledge, the largest speed...
متن کاملParallel Direct Search Methods for Simulation-based Optimization
In many engineering disciplines, the use of realistic computing models has become an invaluable tool in the design process. Complex simulation codes are able to approximate the behavior of intricate systems or the properties of components without the need for costly physical experimentation. Optimization algorithms can be used to automatically find the set of parameters within the design space ...
متن کاملDirect Search Methods on Reductive Homogeneous Spaces
Direct search methods are mainly designed for use in problems with no equality constraints. However, there are many instances where the feasible set is of measure zero in the ambient space and no mesh point lies within it. There are methods for working with feasible sets that are (Riemannian) manifolds, but not all manifolds are created equal. In particular, reductive homogeneous spaces seem to...
متن کاملParallel Direct Solution of Linear Equations on FPGA-Based Machines
The efficient solution of large systems of linear equations represented by sparse matrices appears in many tasks. LU factorization followed by backward and forward substitutions is widely used for this purpose. Parallel implementations of this computation-intensive process are limited primarily to supercomputers. New generations of Field-Programmable Gate Array (FPGA) technologies enable the im...
متن کاملHybrid methods for lot sizing on parallel machines
We consider the capacitated lot sizing problem with multiple items, setup time and unrelated parallel machines, and apply Dantzig-Wolfe decomposition to a strong reformulation of the problem. Unlike in the traditional approach where the linking constraints are the capacity constraints, we use the flow constraints, i.e. the demand constraints, as linking constraints. The aim of this approach is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 1991
ISSN: 1052-6234,1095-7189
DOI: 10.1137/0801027